Constructing an efficient hash function from $3$-isogenies
نویسندگان
چکیده
منابع مشابه
Constructing an Ideal Hash Function from Weak Ideal Compression Functions
We introduce the notion of a weak ideal compression function, which is vulnerable to strong forms of attack, but is otherwise random. We show that such weak ideal compression functions can be used to create secure hash functions, thereby giving a design that can be used to eliminate attacks caused by undesirable properties of compression functions. We prove that the construction we give, which ...
متن کاملConstructing Permutation Rational Functions From Isogenies
A permutation rational function f ∈ Fq(x) is a rational function that induces a bijection on Fq, that is, for all y ∈ Fq there exists exactly one x ∈ Fq such that f(x) = y. Permutation rational functions are intimately related to exceptional rational functions, and more generally exceptional covers of the projective line, of which they form the first important example. In this paper, we show ho...
متن کاملAn Improved Hash Function Based on the Tillich-Zémor Hash Function
Using the idea behind the Tillich-Zémor hash function, we propose a new hash function. Our hash function is parallelizable and its collision resistance is implied by a hardness assumption on a mathematical problem. Also, it is secure against the known attacks. It is the most secure variant of the Tillich-Zémor hash function until now.
متن کاملThe SHAvite-3 Hash Function
In this document we present SHAvite-3, a secure and efficient hash function based on the HAIFA construction and the AES building blocks. SHAvite-3 uses a well understood set of primitives such as a Feistel block cipher which iterates a round function based on the AES round function. SHAvite-3’s compression functions are secure against cryptanalysis, while the selected mode of iteration offers m...
متن کاملVSH, an Efficient and Provable Collision-Resistant Hash Function
We introduce VSH, very smooth hash, a new hash function for which finding collisions is provably reducible to finding nontrivial modular square roots of very smooth numbers modulo a composite integer n. By very smooth, we mean that the smoothness bound is some fixed polynomial function of the bitlength N of n. We show that if collisions for VSH can, asymptotically, be found faster than factorin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: JSIAM Letters
سال: 2017
ISSN: 1883-0609,1883-0617
DOI: 10.14495/jsiaml.9.29